Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs
نویسندگان
چکیده
We characterize unmixed and Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs. also provide examples oriented graphs that have non-Cohen-Macaulay vertex-weighted ideals, while the ideal their underlying graph is Cohen-Macaulay. This disproves a conjecture posed by Pitones, Reyes, Toledo.
منابع مشابه
Sequentially Cohen-macaulay Edge Ideals
Let G be a simple undirected graph on n vertices, and let I(G) ⊆ R = k[x1, . . . , xn] denote its associated edge ideal. We show that all chordal graphs G are sequentially Cohen-Macaulay; our proof depends upon showing that the Alexander dual of I(G) is componentwise linear. Our result complements Faridi’s theorem that the facet ideal of a simplicial tree is sequentially Cohen-Macaulay and impl...
متن کاملOn Well-Covered, Vertex Decomposable and Cohen-Macaulay Graphs
Let G = (V,E) be a graph. If G is a König graph or if G is a graph without 3-cycles and 5-cycles, we prove that the following conditions are equivalent: ∆G is pure shellable, R/I∆ is Cohen-Macaulay, G is an unmixed vertex decomposable graph and G is well-covered with a perfect matching of König type e1, . . . , eg without 4-cycles with two ei’s. Furthermore, we study vertex decomposable and she...
متن کاملCohen-Macaulay clutters with combinatorial optimization properties and parallelizations of normal edge ideals
Let C be a uniform clutter and let I = I(C) be its edge ideal. We prove that if C satisfies the packing property (resp. max-flow min-cut property), then there is a uniform Cohen-Macaulay clutter C1 satisfying the packing property (resp. max-flow min-cut property) such that C is a minor of C1. For arbitrary edge ideals of clutters we prove that the normality property is closed under parallelizat...
متن کاملm at h . A C ] 1 N ov 2 00 5 SEQUENTIALLY COHEN - MACAULAY EDGE IDEALS
Let G be a simple undirected graph on n vertices, and let I(G) ⊆ R = k[x 1 ,. .. , x n ] denote its associated edge ideal. We show that all chordal graphs G are sequentially Cohen-Macaulay; our proof depends upon showing that the Alexander dual of I(G) is componentwise linear. Our result complements Faridi's theorem that the facet ideal of a simplicial tree is sequentially Cohen-Macaulay and He...
متن کاملBi-Cohen-Macaulay graphs
In this paper we consider bi-Cohen-Macaulay graphs, and give a complete classification of such graphs in the case they are bipartite or chordal. General biCohen-Macaulay graphs are classified up to separation. The inseparable bi-CohenMacaulay graphs are determined. We establish a bijection between the set of all trees and the set of inseparable bi-Cohen-Macaulay graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 2021
ISSN: ['1532-4125', '0092-7872']
DOI: https://doi.org/10.1080/00927872.2021.1917590